An Efficient Secret Key Homomorphic Encryption Used in Image Processing Service
نویسندگان
چکیده
منابع مشابه
Homomorphic Secret Sharing from Paillier Encryption
A recent breakthrough by Boyle et al. [7] demonstrated secure function evaluation protocols for branching programs, where the communication complexity is sublinear in the size of the circuit (indeed just linear in the size of the inputs, and polynomial in the security parameter). Their result is based on the Decisional Diffie-Hellman assumption (DDH), using (variants of) the ElGamal cryptosyste...
متن کاملEfficient fully homomorphic encryption with circularly secure key switching process
Fully homomorphic encryption (FHE) has important applications in cloud computing. However, almost all fully homomorphic encryption schemes share two common flaws that they all use large-scale secret keys and some operations inefficient. In this paper, the “special b” variant of the Learning With Errors problem (bLWE) is presented, and helps us construct the first circularly secure key switching...
متن کاملQuantum Secret Communication without an Encryption Key
Quantum cryptographic methods increase security over classical methods. To date, quantum algorithms aim to distribute a secret key to be used afterwards to encrypt messages. The method described in this paper does not use an encryption key at all. An array of qubits is transmitted from the source to the destination with the message encoded in the phase of the qubit. The secrecy of the message d...
متن کاملPlaintext Related Two-level Secret Key Image Encryption Scheme
Some chaos-based image encryption schemes using plain-images independent secret code streams have weak encryption security and are vulnerable to chosen plaintext and chosen cipher-text attacks. This paper proposed a two-level secret key image encryption scheme, where the first-level secret key is the private symmetric secret key, and the second-level secret key is derived from both the first-le...
متن کاملEfficient Integer Vector Homomorphic Encryption
Homomorphic Encryption yields deliberately malleable ciphertext, allowing operations on encrypted data. We outline and implement a homomorphic encryption scheme as suggested by Zhou and Wornell [1] that encrypts integer vectors to allow computation of arbitrary polynomials in the encrypted domain with a bounded degree. This finds applications particularly in cloud computation, when one is inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2017
ISSN: 1939-0114,1939-0122
DOI: 10.1155/2017/7695751